DNA computing : the arrival of biological
نویسنده
چکیده
\Come forth into the light of things Let nature be your teacher." (Wordsworth, 72]) 1 Biological mathematics: the tables turned The eld usually referred to as mathematical biology is a highly interdisciplinary area that lies at the intersection of mathematics and biology. Classical illustrations include the development of stochastic processes and statistical methods to solve problems in genetics and epidemiology. As the name used to describe work in this eld indicates, with \biology" the noun, and \mathematical" the modifying adjective, the relationship between mathematics and biology has so far been one{way. Typically, mathematical results have emerged from or have been used to solve biological problems (see 34] for a comprehensive survey). In contrast, Leonard Adleman, 1], succeeded in solving an instance of the directed Hamiltonian path problem solely by manipulating DNA strings. This marks the rst instance of the connection being reversed: a mathematical problem is the end toward which the tools of biology are used. To be semantically correct , instead of categorizing the research in DNA computing as belonging to mathematical biology, we should be employing the mirror{image term biological mathematics for the eld born in November 1994. Despite the complexity of the technology involved, the idea behind biological mathematics is the simple observation that the following two processes, one biological and one mathematical, are analogous: (a) the very complex structure of a living being is the result of applying simple operations (copying, splicing, etc.) to initial information encoded in a DNA sequence, (b) the result f(w) of applying a computable function to an argument w can be obtained by applying a combination of basic simple functions to w (see Section 4 or 65] for details).
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملMitochondrial DNA variation, genetic structure and demographic history of Iranian populations
In order to survey the evolutionary history and impact of historical events on the genetic structure of Iranian people, the HV2 region of 141 mtDNA sequences related to six Iranian populations were analyzed. Slight and non-significant FST distances among the Central-western Persian speaking populations of Iran testify to the common origin of these populations from one proto-population. Mismatch...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملDNA computing: the arrival of biological mathematics
The field usually referred to as mathematical biology is a highly interdisciplinary area that lies at the intersection of mathematics and biology. Classical illustrations include the development of stochastic processes and statistical methods to solve problems in genetics and epidemiology. As the name used to describe work in this field indicates, with “biology” the noun, and “mathematical” the...
متن کامل